Locality in Reasoning about Graph Transformations
نویسنده
چکیده
This paper explores how to reason locally about global properties of graph transformations, in particular properties involving transitive closure of the edge relations of the graph. We show under which conditions we can soundly reduce reasoning about all nodes in the graph to reasoning about a finite set of nodes. We then give an effective procedure to turn this reduced problem into a Boolean satisfiability problem.
منابع مشابه
Exploiting Locality in
Temporal reasoning with uncertainty about the ordering of events is important in a wide variety of applications. Previous research shows that the associated decision problems are hard even for very restricted cases. In this paper, we investigate using the temporal locality of events and the spatial locality of state spaces to speed inference. We propose a new perspective for representing cause-...
متن کاملLocality-enhancing loop transformations for parallel tree traversal algorithms
Exploiting locality is critical to achieving good performance. For regular programs, which operate on dense arrays and matrices, techniques such as loop interchange and tiling have long been known to improve locality and deliver improved performance. However, there has been relatively little work investigating similar locality-improving transformations for irregular programs that operate on tre...
متن کاملEnsuring Correctness of Model Transformations
This paper is concerned with the interplay of the expressiveness of model and graph transformation languages, of assertion formalisms making correctness statements about transformations, and the decidability of the resulting verification problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that ...
متن کاملAn Example of Local Reasoning in Bi Pointer Logic: the Schorr-waite Graph Marking Algorithm (draft)
Reasoning about programs manipulating pointers has been considered as diicult not because of the lack of formalisms for verifying pointer programs, but because of the signiicant increase in the complexity of proofs in each formalism over an informal argument. Recently, there has been noticeable development in handling the complexity by exploiting locality of memory access within a code fragment...
متن کاملNew approaches for representing, analyzing and visualizing complex kinetic mechanisms
Complex kinetic representations involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems. In order to represent, analyze and visualize effectively the ignition processes advanced computational techniques will be required. Recently, we introduced a novel concept that captured the principal elemental t...
متن کامل